home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
ftp.cs.arizona.edu
/
ftp.cs.arizona.edu.tar
/
ftp.cs.arizona.edu
/
icon
/
newsgrp
/
group96a.txt
/
000126_icon-group-sender _Sun Jun 9 16:07:46 1996.msg
< prev
next >
Wrap
Internet Message Format
|
1996-09-05
|
1KB
Received: by cheltenham.cs.arizona.edu; Mon, 10 Jun 1996 08:00:28 MST
To: icon-group@cs.arizona.edu
Date: Sun, 9 Jun 1996 16:07:46 GMT
From: leeo@eskimo.com (Lee Odegard)
Message-Id: <Dsqq4z.AsA@eskimo.com>
Organization: Eskimo North (206) For-Ever
Sender: icon-group-request@cs.arizona.edu
References: <199606071540.LAA18004@morgoth>, <4pa3hq$lpc@labrador.cs.purdue.edu>, <4pd03h$g3o@lectura.CS.Arizona.EDU>
Subject: Re: m3 should have SWAP(a,b)
Errors-To: icon-group-errors@cs.arizona.edu
Status: O
dave@CS.Arizona.EDU (Dave Schaumann) writes:
>As you say. For my part, the only time I've found 'swap' to be a useful
>operation is when I am writing sort algorithm (or sort-related algorithms,
>like heap manipulation).
In my own work, I've seen many instances where algorithms could be described
more succintly with
designator := expr_designator := expression ;
to abbreviate
designator := expr_designator ;
expr_designator := expression ;
In this notation, a swap would appear
VAR temp : type_of_designator ; BEGIN
temp := item1 := item2 := temp ; END ;
--Lee